#include"Sort.h"

void SelectSortTest()
{
	//int a[] = { 2,3,5,7,0,3,8,10 };
	int a[]={ 9,1,2,5,7,4,6,3 }; 
	SelectSort(a, sizeof(a) / sizeof(a[0]));
	Print(a, sizeof(a) / sizeof(a[0]));
}
void BubbleSortTest()
{
	int a[] = { 9,1,2,5,7,4,6,3 };
	BubbleSort(a, sizeof(a) / sizeof(a[0]));
	Print(a, sizeof(a) / sizeof(a[0]));
}
void InsertSortTest()
{
	int a[] = { 9,1,2,5,7,4,6,3 };
	InsertSort(a, sizeof(a) / sizeof(a[0]));
	Print(a, sizeof(a) / sizeof(a[0]));
}
void ShellSortTest()
{
	int a[] = { 9,1,2,5,7,4,6,3 };
	ShellSort(a, sizeof(a) / sizeof(a[0]));
	Print(a, sizeof(a) / sizeof(a[0]));
}

void HeapSortTest()
{
	int a[] = { 9,1,2,5,7,4,6,3 };
	HeapSort(a, sizeof(a) / sizeof(a[0]));
	Print(a, sizeof(a) / sizeof(a[0]));
}
void QuickSortTest()
{
	int a[] = { 9,1,2,5,7,4,6,3 };
	QuickSort(a, 0,sizeof(a) / sizeof(a[0])-1);
	Print(a, sizeof(a) / sizeof(a[0]));
}
void QuickSortTest1()
{
	int a[] = { 9,1,2,5,7,4,6,3 };
	QuickSort2(a, 0, sizeof(a) / sizeof(a[0]) - 1);
	Print(a, sizeof(a) / sizeof(a[0]));
}
int main()
{
	//SelectSortTest();
	//BubbleSortTest();
	//InsertSortTest();
	//ShellSortTest();
	//HeapSortTest();
	//QuickSortTest();
	QuickSortTest1();
	return 0;
}